Designing Cluster Schedulers for Internet-Scale Services
نویسندگان
چکیده
منابع مشابه
On Designing and Deploying Internet-Scale Services
The system-to-administrator ratio is commonly used as a rough metric to understand administrative costs in high-scale services. With smaller, less automated services this ratio can be as low as 2:1, whereas on industry leading, highly automated services, we’ve seen ratios as high as 2,500:1. Wi t h i n Microsoft services, Autopilot [1] is often cited as the magic behind the success of the Windo...
متن کاملPerformance Guarantees for Cluster-Based Internet Services
As web-based transactions become an essential element of everyday corporate and commerce activities, it becomes increasingly important that the performance of web-based services be predictable and guaranteed even in the presence of wildly fluctuating input loads. In this paper, we propose a general implementation framework to provide quality of service (QoS) guarantee for cluster-based Internet...
متن کاملSpeculation-aware Resource Allocation for Cluster Schedulers
Resource allocation and straggler mitigation (via “speculative” copies) are two key building blocks for analytics frameworks. Today, the two solutions are largely decoupled from each other, losing the opportunities of joint optimization. Resource allocation across jobs assumes that each job runs a fixed set of tasks, ignoring their need to dynamically run speculative copies for stragglers. Cons...
متن کاملMiddleware QoS Agents and Native Kernel Schedulers for Adaptive Multimedia Services and Cluster Servers
Emerging operating systems allow user applications ne grain control over their own resource allocations. This provides a promising approach for user applications to meet their timing constraints. In a distributed environment , however, resource allocation decisions must also be made across machine and traditional OS boundaries. As portable and mobile software entities, middleware agents can man...
متن کاملBeyond Proportional Fair: Designing Robust Wireless Schedulers
Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve “well-behaved” users in practice. One of the main causes behind PF-induced starvation is its inability to distinguish between users who are backlogged and users who are not. In this paper, we describe how a simple parallel PF instance can mitigate such starvation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2018
ISSN: 1542-7730,1542-7749
DOI: 10.1145/3194653.3199609